考虑中断的制造型供应链协调调度模型

供应链协调调度能有效提高企业应对供应链中断的能力。以两阶段制造供应链为研究对象，研究了中断情境下具有交付时间约束的多产品类型制造供应链协调调度问题。制造商接到包含多产品类型的工件加工订单，各工件需经供应商处理为原材料工件后，交付给制造商处理为完成品，各工件均有一个独立的交付期。如果供应商单方面调整工件加工顺序，会导致制造商冲突成本的增加，需双方协商处理。以最小化供应商总拖期交付成本和最小化制造商总冲突成本为目标，基于收益共享契约协调机制，构建了考虑中断的制造型供应链协调调度模型。设计了一个融合自适应邻域搜索算子的混合自适应遗传算法。通过算例仿真，验证了所提模型与算法的有效性。     

基于MapReduce模型带准备时间的平行机调度优化

研究了一类基于MapReduce模型的平行机调度问题.每个工件包含Map和Reduce两道加工工序,Map工序可以分割为若干个子任务,并且在多台平行机上同时并行加工,Reduce工序只有在该工件的所有Map工序的子任务加工完成后才能进行,而且Reduce只能在一台机器上加工且不可中断.结合工件具有释放时间和加工准备时间等约束,以最小化最大完工时间为目标,构建了混合整数规划模型,并设计了采用差分变异策略和逐维Levy扰动机制的改进正弦余弦算法来求解该模型.最后,利用数值仿真实验与标准正弦余弦算法及遗传算法进行对比,实验结果表明,运用改进正弦余弦算法求解的结果与下界值的平均相对偏差GAP为3.02%,较标准正弦余弦算法以及遗传算法的效果提升显著,显示了该改进算法的有效性.     

基于机会约束的手术计划随机模型与算法

本文研究多服务台手术计划调度问题,考虑手术时间的不确定性,提出手术室加班时间的机会约束,以一定的概率保证病人的手术时间不超过手术室的开放时间,建立随机优化机会约束手术计划调度模型,确定手术室的开放和分配决策.基于手术时间离散的概率情景,引入0-1变量转化机会约束,得到了0-1整数线性规划的等价模型.为了提高模型的求解效率,提出两类有效不等式,并设计最长路径算法分离第二类有效不等式,利用分支切割方法进行模型求解.算例分析,基于北京某医院的实际数据,验证算法的有效性,确定最优的手术计划调度方案,有效地优化配置手术室资源.     

浅谈基于浸润原理的事务安排算法

针对单个安排事务避免冲突的传统方法 ,提出一种基于浸润原理的事物安排算法。该算法采用漫布式将各个事务分摊到各个位置 ,根据条件计算权值 ,并有意造成冲突 ,从而发现冲突位置 ,最后从最不可能冲突的位置入手 ,逐步完成安排过程。该方法事务安排的复杂度为 O(n2× k× x) ,大大减少事务安排所需的时间 .     

用遗传算法解决一类模糊流水车间调度问题

对同时考虑模糊加工时间和模糊交货期的模糊流水车间调度问题进行了研究 ,模糊加工时间用三角模糊数来表示 ,模糊交货期用梯形模糊数来表示。应用遗传算法搜索最优排序 ,在适应度函数处理中引入模糊数处理方法 ,以平均满意度最大作为优化目标。最后给出了实验结果和结论     

LOGISTICS SCHEDULING： ANALYSIS OFTWO-STAGE PROBLEMS

This paper studies the coordination effects between stages for scheduling problems where decision-making is a two-stage process. Two stages are considered as one system. The system can be a supply chain that links two stages, one stage representing a manufacturer; and the other, a distributor It also can represent a single manufacturer, while each stage represents a different department responsible for a part of operations. A problem that jointly considers both stages in order to achieve ideal overall system performance is defined as a system problem. In practice, at times, it might not be feasible for the two stages to make coordinated decisions due to (i) the lack of channels that allow decision makers at the two stages to cooperate, and/or (ii) the optimal solution to the system problem is too difficult (or costly) to achieve.Two practical approaches are applied to solve a variant of two-stage logistic scheduling problems. The Forward Approach is defined as a solution procedure by which the first sta     

FROM MANUFACTURING SCHEDULING TO SUPPLY CHAIN COORDINATION：THE CONTROL OF COMPLEXITY AND UNCERTAINTY

With time-based competition and rapid technology advancements, effective manufacturingscheduling and supply chain coordination are critical to quickly respond to changing marketconditions. These problems, however, are difficult in view of inherent complexity and variousuncertainties involved. Based on a series of results by the authors, decomposition and coordination byusing Lagrangian relaxation is identified in this paper as an effective way to control complexity anduncertainty.A manufacturing scheduling problem is first formulated within the job shop context withuncertain order arrivals, processing times, due dates, and part priorities as a separable optimizationproblem. A solution methodology that combines Lagrangian relaxation, stochastic dynamicprogramming, and heuristics is developed. Method improvements to effectively solve large problemsare also highlighted. To extend manufacturing scheduling within a factory to coordinate autonomicmembers across chains of suppliers, a decentralized supply chai     

SCHEDULING PROBLEMS - AN OVERVIEW

There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days. These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition,     

网络化制造环境下生产动态调度仿真与分析

针对网络化制造环境下生产系统特点,构建异地生产协同调度框架.基于调度框架进行动态仿真计算:应用模糊理论对生产时间分布概率进行判断,确定企业内部生产调度评测参数;使用Hopfield神经网络综合决策,求出企业外协生产与内部调度之间的可行解.将调度框架应用在实际生产调度问题中,对仿真计算结果继续综合优化,能够得到好的可行调度方案.     

单机不同尺寸工件批调度问题的优化算法

研究了单机环境下不同尺寸工件的批调度问题,引入微粒群算法对制造跨度进行优化.首先给出了问题的微粒表达形式,并根据问题的离散优化特性对微粒状态的更新方法进行了改进;然后将微粒群算法和分批的启发式算法进行有效结合,改善近似解的质量.实验中对各类不同规模的算例均进行了仿真,结果表明了微粒群算法的有效性.